A Control Policy for a Priority Queue with Removable Server
نویسندگان
چکیده
منابع مشابه
A Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملA Preemptive Priority Queue as a Model with Server Vacations
We derive the performance measures for non-priority customers in a priority single-server queue with two types of Markovian arrival processes (MAPs). One type of customers has preemptive resume (or repeat) priority over the other. We regard the model with two types of MAP arrivals as an MAP/SM/l queue with only non-priority customers arrivals, semi-Markovian service times and some server vacati...
متن کاملMultiple vacation policy for MX/Hk/1 queue with un-reliable server
This paper studies the operating characteristics of an MX/Hk/1 queueing system under multiple vacation policy. It is assumed that the server goes for vacation as soon as the system becomes empty. When he returns from a vacation and there is one or more customers waiting in the queue, he serves these customers until the system becomes empty again, otherwise goes for another vacation. The brea...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملOptimality of D-Policies for an M/G/1 Queue with a Removable Server
We consider an M/G/1 queue with a removable server. When a customer arrives, the workload becomes known. The cost structure consists of switching costs, running costs, and holding costs per unit time which is a nonnegative nondecreasing right-continuous function of a current workload in the system. We prove an old conjecture that D-policies are optimal for the average cost per unit time criteri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1974
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.22.4.833